New Models for Recognition of Picture Languages: Sgraffito and Restarting Tiling Automata
نویسندگان
چکیده
We introduce two new models of two-dimensional computing devices called sgraffito automaton and restarting tiling automaton. The models fulfill two conditions. Firstly, they do not exceed the power of finite-state automata when working over one-dimensional inputs. And secondly, they allow a clear design of important computations. We study properties of the induced families of picture languages. We show that they include strictly REC and that restarting tiling automata are able to simulate sgraffito automata. An interesting family is settled by deterministic sgraffito automata. It can be seen as an alternative to DREC.
منابع مشابه
Recognizable and Rational Picture Series?
The theory of two-dimensional languages as a generalization of formal string languages was motivated by problems arising from image processing and pattern recognition and also concerns models of parallel computing. Here we investigate power series on pictures and assign weights to different devices, ranging from tiling systems to picture automata. We will prove that, for commutative semirings, ...
متن کاملAmbiguity and Complementation in Recognizable Two-dimensional Languages
The theory of one-dimensional (word) languages is well founded and investigated since fifties. From several years, the increasing interest for pattern recognition and image processing motivated the research on two-dimensional or picture languages, and nowadays this is a research field of great interest. A first attempt to formalize the concept of finite state recognizability for two-dimensional...
متن کاملA Note on Unambiguity, Finite Ambiguity and Complementation in Recognizable Two-Dimensional Languages
The theory of one-dimensional (word) languages is well founded and investigated since fifties. From several years, the increasing interest for pattern recognition and image processing motivated the research on two-dimensional or picture languages, and nowadays this is a research field of great interest. A first attempt to formalize the concept of finite state recognizability for twodimensional ...
متن کاملCharacterizations of recognizable picture series
The theory of two-dimensional languages as a generalization of formal string languages was motivated by problems arising from image processing and pattern recognition and also concerns models of parallel computing. In the nineties, Restivo and Giammarresi defined the family REC of recognizable picture languages [GR97]. This family is very robust and has been characterized by many different devi...
متن کاملDeterministic recognizability of picture languages with Wang automata
We present a model of automaton for picture language recognition, called Wang automaton, which is based on labeled Wang tiles. Wang automata combine features of both online tessellation acceptors and 4-way automata: as in online tessellation acceptors, computation assigns states to each picture position; as in 4-way automata, the input head visits the picture moving from one pixel to an adjacen...
متن کامل